Deductively Definable Logics of Induction
نویسندگان
چکیده
منابع مشابه
Deductively Definable Logics of Induction
A broad class of inductive logics that includes the probability calculus is defined by the conditions that the inductive strengths [A|B] are defined fully in terms of deductive relations in preferred partitions and that they are asymptotically stable. Inductive independence is shown to be generic for propositions in such logics; a notion of a scale-free inductive logic is identified; and a limi...
متن کاملDefinable Transductions and Weighted Logics for Texts
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduce an algebraic notion of recognizability following Reutenauer and Bozapalidis as well as weighted automata for texts combining an automaton model of Lodaya and Weil with a model of Ésik and Németh. After that we show t...
متن کاملWhich truth values in fuzzy logics are definable?
In fuzzy logic, every word or phrase describing uncertainty is represented by a real number from the interval 0; 1]. There are only denu-merable many words and phrases, and continuum many real numbers; thus, not every real number corresponds to some commonsense degree of uncertainty. In this paper, for several fuzzy logic, we describe which numbers are describing such degrees, i.e., in mathemat...
متن کاملDefinable fixed points in modal and temporal logics : A survey
The paper presents a survey of author’s results on definable fixed points in modal, temporal, and intuitionistic propositional logics. The well-known Fixed Point Theorem considers the modalized case, but here we investigate the positive case. We give a classification of fixed point theorems, describe some classes of models with definable least fixed points of positive operators, special positiv...
متن کاملModal Logics Definable by Universal Three-Variable Formulas
We consider the satisfiability problem for modal logic over classes of structures definable by universal first-order formulas with three variables. We exhibit a simple formula for which the problem is undecidable. This improves an earlier result in which nine variables were used. We also show that for classes defined by three-variable, universal Horn formulas the problem is decidable. This subs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Philosophical Logic
سال: 2010
ISSN: 0022-3611,1573-0433
DOI: 10.1007/s10992-010-9146-2